Security games with partial surveillance

نویسندگان

  • Youzhi Zhang
  • Xudong Luo
چکیده

Security games are used to deploy limited security resources. Much work on the topic assumes that attackers have the perfect knowledge of defenders’ strategies. However, it is not always the case in real life because an attacker may worry he will be caught if he observes defender’s strategy on all targets. To address the issue, this paper proposes a new game model in which the attacker just selects partial targets to observe according to his goal and observation cost. Moreover, our theoretical and experimental analyses show that our model reflects well the way that attackers make decisions, and in particular, the defender can gain significantly higher utility by considering the attacker can only conduct observations on partial targets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation Approaches for Solving Security Games with Surveillance Cost: A Preliminary Study

Security game models have been deployed to allocate limited security resources for critical infrastructure protection. Much work on this topic assumes that attackers have perfect knowledge of the defender’s randomized strategy. However, this assumption is not realistic, considering surveillance cost, since attackers may only have partial knowledge of the defender’s strategies, and may dynamical...

متن کامل

Security Games with Limited Surveillance

Randomized first-mover strategies of Stackelberg games are used in several deployed applications to allocate limited resources for the protection of critical infrastructure. Stackelberg games model the fact that a strategic attacker can surveil and exploit the defender’s strategy, and randomization guards against the worst effects by making the defender less predictable. In accordance with the ...

متن کامل

Security games with surveillance cost and optimal timing of attack execution

Stackelberg games have been used in several deployed applications to allocate limited resources for critical infrastructure protection. These resource allocation strategies are randomized to prevent a strategic attacker from using surveillance to learn and exploit patterns in the allocation. Past work has typically assumed that the attacker has perfect knowledge of the defender’s randomized str...

متن کامل

Security Games with Information Leakage: Modeling and Computation

Most models of Stackelberg security games assume that the attacker only knows the defender’s mixed strategy, but is not able to observe (even partially) the instantiated pure strategy. Such partial observation of the deployed pure strategy – an issue we refer to as information leakage – is a significant concern in practical applications. While previous research on patrolling games has considere...

متن کامل

Lazy Defenders Are Almost Optimal against Diligent Attackers

Most work building on the Stackelberg security games model assumes that the attacker can perfectly observe the defender’s randomized assignment of resources to targets. This assumption has been challenged by recent papers, which designed tailor-made algorithms that compute optimal defender strategies for security games with limited surveillance. We analytically demonstrate that in zero-sum secu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014